A hybrid quotient algorithm
نویسندگان
چکیده
We describe an algorithm which takes as input a finitely presented group F, a finite confluent rewriting system for a quotient G and a prime p, and returns as output a finite confluent rewriting system for the largest extension of an elementary abelian group in characteristic p by G which is still an epimorphic image of F.
منابع مشابه
Calculation of three-regions input-output coefficients, hybrid Location Quotient - Gravity Method, (Case Study: oil-rich regions, Tehran Province, and the rest national economies)
Regional policy requires the use of a suitable economic model. One of the common patterns in this field is the multi-region input-output model in which the national economy is subdivided into regions with different comparative advantages and on the basis of specific policies. Multi-regional input-output data preparation in Iran has always been one of the main challenges in using them to measure...
متن کاملÊêêøøòòùððö Àýýööö Ññ×´´üøøòòòò
In order to study control problems for hybrid systems, we generalize hybrid automata to hybrid games |say, controller vs. plant. If we specify the continuous dynamics by constant lower and upper bounds, we obtain rectangular games. We show that for rectangular games with objectives expressed in Ltl (linear temporal logic), the winning states for each player can be computed, and winning strategi...
متن کاملVerification of infinite-state dynamic systems using approximate quotient transition systems
This paper concerns computational methods for verifying properties of labeled infinite-state transition systems (e.g., hybrid systems) using quotient transition system (QTS). A QTS is a conservative approximation to the infinite-state transition system based on a finite partition of the infinite state space. For universal specifications, positive verification for a QTS implies the specification...
متن کاملState Equivalences for Rectangular Hybrid Automata
Three natural equivalence relations on the in nite state space of a hybrid automaton are language equivalence, simulation equivalence, and bisimulation equivalence. When one of these equivalence relations has a nite quotient, certain model checking and controller synthesis problems are decidable. When bounds on the number of equivalence classes are obtained, bounds on the running times of model...
متن کاملA novel hybrid meta-heuristic technique applied to the well-known benchmark optimization problems
In this paper, a hybrid meta-heuristic algorithm, based on imperialistic competition algorithm (ICA), harmony search (HS), and simulated annealing (SA) is presented. The body of the proposed hybrid algorithm is based on ICA. The proposed hybrid algorithm inherits the advantages of the process of harmony creation in HS algorithm to improve the exploitation phase of the ICA algorithm. In addition...
متن کامل